A More Expressive Deterministic Query Language with Efficient Symmetry-Based Choice Construct
نویسندگان
چکیده
In this paper, symmetry-based choice mechanisms are exploited to compute deterministic queries. We investigate a particular form of these choice mechanisms, called specified symmetry choice. This mechanism is efficient (i.e. computable in polynomial time) and can be added to Fixpoint Logic to give a language that is more powerful than the extension of Fixpoint with Counting.
منابع مشابه
Non-Determinism in Deductive Databases
This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the choice construct introduced by Krishnamurthy and Naqvi, from the viewpoints of amenability to efficient implementation and expressive power. Thus, we define a construct called dynamic choice, which is consistent with ...
متن کاملSequential Algorithms , Deterministic Parallelism , and
We call language L 1 intensionally more expressive than L 2 if there are functions which can be computed faster in L 1 than in L 2. We study the intensional expressive-ness of several languages: the Berry-Curien programming language of sequential algorithms, CDS0, a de-terministic parallel extension to it, named CDSP, and various parallel extensions to the functional programming language PCF. T...
متن کاملExpressiveness of Efficient Semi-Deterministic Choice Constructs
Recently, Abiteboul and Kanellakis introduced the notion of determinate query to describe database queries having the ability to create new domain elements. As there are no natural determinate-complete query languages known, more restrictive (the constructive queries) and more general (the semi-deterministic queries) notions of query were considered. Here, we show that the advantage of the seco...
متن کاملDatalog with Non-Deterministic Choice Computes NDB-PTIME
This paper addresses the issue of non-deterministic extensions of logic database languages. After providing a brief overview of the main proposals in the literature, we concentrate on the analysis of the dynamic choice construct from the point of view of the expressive power. We show how such construct is capable of expressing several interesting deterministic problems, such as computing the co...
متن کاملExtending XPath to Support Linguistic Queries
Linguistic research and language technology development employ large repositories of ordered trees. XML, a standard ordered tree model, and XPath, its associated language, are natural choices for linguistic data storage and queries. However, several important expressive features required for linguistic queries are missing in XPath. In this paper, we motivate and illustrate these features with a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996